Efficient Pseudo-Boolean Satisfiability Encodings for Routing and Wavelength Assignment in Optical Networks

نویسندگان

  • Miroslav N. Velev
  • Ping Gao
چکیده

We propose a novel method for combined Routing and Wavelength Assignment (RWA) in optical networks by reformulation to an equivalent Pseudo-Boolean Satisfiability (PB-SAT) problem. We introduce edge observability variables to represent whether an edge is on the optimal route, combined with either a simple or a hierarchical SAT encoding to select a wavelength for that edge only when the edge is on the route. This translation exponentially reduces the size of the solution space, making it independent of the number of wavelengths per link. We present experimental results for routing instances with up to 3,000 nodes, 15,000 edges, and 2,048 wavelengths per edge, and achieve at least 8 orders of magnitude speedup relative to a previous PB-SAT encoding by Aloul et al., such that the speedup is increasing with the number of nodes and edges in the network, and the number of wavelengths per edge. A portfolio of 4 parallel strategies, each based on the new approach and a different hierarchical encoding, resulted in additional speedup of up to 6 times, and reduced the variability of the run times for large networks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks

Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of  regeneration capabilities, the physical layer i...

متن کامل

Bio-inspired Routing and Wavelength Assignment Algorithm for Optical Mesh Networks

Optical networks have been widely implemented and they are usually used as the backbone of high-capacity telecommunication infrastructures. However, the nowadays traffic demand over these networks has increased in a way that congestion over the architecture is considerable. Due to the high costs of implementing new optical links, the routing and wavelength assignment process become an important...

متن کامل

Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability

In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the MCM problem optimally. To the best of our knowledge, the proposed encodings and the optimization algorithm are the first formalization of the MCM problem in a PBS manner. This report evaluates the complexity of the prob...

متن کامل

Routing, wavelength assignment, and spectrum allocation algorithms in transparent flexible optical WDM networks

Current fixed grid wavelength routed networks are limited in terms of spectral efficiency due to the rigid nature of wavelength assignment. We propose the Flexible Optical WDM (FWDM) network architecture for flexible grid optical networks in which the constraint on fixed spectrum allocation to channels is removed and network resources can be dynamically provisioned with an automated control pla...

متن کامل

An Algorithm for Waveband Routing and Wavelength Assignment in Hierarchical WDM Mesh Networks

Aggregation of wavelengths into wavebands is an attractive, cost-efficient way to facilitate switching and routing in optical networks. In this paper, we study the waveband routing and wavelength assignment (WRWA) tasks in hierarchical WDM mesh networks with optical crossconnects that can route multiple granularity (wavelengths and wavebands) at the same time. We solve the waveband routing and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011